COMMENT ⊗   VALID 00002 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002				SEMINAR ON LOGIC GRAMMARS
C00003 ENDMK
C⊗;
			SEMINAR ON LOGIC GRAMMARS

				 V. Dahl

Abstract

	Logic grammars are grammars expressible in the clausal form of
logic, for which a theorem-prover based processor (e.g., Parolog) can
act as a parser or an analyser.  We present their historic evolution and
current trends, relating them to the particular language-processing
problems they were designed to solve.  Concrete applications exist,
mainly for natural language front ends to databases or to expert 
systems, but also for extra-linguistic ends such as compiling or even
problem-solving.  NO knowledge of Prolog is assumed in the talk.